Learnability of Pregroup Grammars

نویسندگان

  • Denis Béchet
  • Annie Foret
  • Isabelle Tellier
چکیده

This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input called feature-tagged examples. A learning algorithm based on the parsing strategy presented in the first part is given. Its validity is proved and its properties are examplified.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

D.Béchet A.Foret

This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...

متن کامل

A Pregroup Toolbox for Parsing and Building Grammars of Natural Languages

Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.

متن کامل

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data

Learnability of Pregroup Grammars p. 65 A Markovian Approach to the Induction of Regular String Distributions p. 77 Learning Node Selecting Tree Transducer from Completely Annotated Examples p. 91 Identifying Clusters from Positive Data p. 103 Introducing Domain and Typing Bias in Automata Inference p. 115 Analogical Equations in Sequences: Definition and Resolution p. 127 Representing Language...

متن کامل

Pregroup Grammars and Context-free Grammars

Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...

متن کامل

A Savateev-Style Parsing Algorithm for Pregroup Grammars

We present a new cubic parsing algorithm for ambiguous pregroup grammars. It modifies the recognition algorithm of Savateev [10] for categorial grammars based on L\. We show the correctness of the algorithm and give some examples. We compare our algorithm with the algorithm of Oehrle [8] for pregroup grammars and the algorithm of

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 87  شماره 

صفحات  -

تاریخ انتشار 2004